Cook–Levin theorem - PDFSEARCH.IO - Document Search Engine

Cook–Levin theorem
Results: 17

#	Item
11	Properties of NP-Complete Sets Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta ∗ † Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-01-15 13:02:20 Complexity classes NP P versus NP problem PP Sparse language P Cook–Levin theorem NP-hard Theoretical computer science Computational complexity theory Applied mathematics
12	Data reduction for weighted and outlier-resistant clustering Add to Reading List Source URL: siam.omnibooksonline.com Language: English - Date: 2011-11-18 11:45:34 Cook–Levin theorem Factorization of polynomials over a finite field and irreducibility tests Mathematics Modular arithmetic Computational complexity theory
13	A Brief History of NP-Completeness, 1954–2012 David S. Johnson Mathematics subject classification: 68-03, 68Q17, 68Q25, 68W25, 90C05, 90C22 Add to Reading List Source URL: www.research.att.com Language: English - Date: 2012-09-06 18:30:18 Complexity classes NP-complete Cook–Levin theorem P versus NP problem NP-hard NP Stephen Cook Clique problem P Theoretical computer science Computational complexity theory Applied mathematics
14	i Computational Complexity: A Modern Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2007-01-08 22:00:26 Complexity classes NP P versus NP problem Cook–Levin theorem P Boolean satisfiability problem Reduction Time complexity Co-NP-complete Theoretical computer science Computational complexity theory Applied mathematics
15	PDF Document Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2012-07-31 20:46:00 Complexity classes Circuit complexity ACC0 NTIME Cook–Levin theorem PP Natural proof NP-complete Time complexity Theoretical computer science Computational complexity theory Applied mathematics
16	PDF Document Add to Reading List Source URL: www-imai.is.s.u-tokyo.ac.jp Language: English - Date: 2003-05-03 02:39:28 Complexity classes Mathematical optimization NP-complete Boolean satisfiability problem NP IP MAX-3SAT Cook–Levin theorem Theoretical computer science Computational complexity theory Applied mathematics
17	PDF Document Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2007-01-08 22:00:38 Complexity classes True quantified Boolean formula PSPACE-complete FO NP P NSPACE DSPACE Cook–Levin theorem Theoretical computer science Computational complexity theory Applied mathematics